Short Proofs of Strong Normalization
نویسنده
چکیده
This paper presents simple, syntactic strong normalization proofs for the simply-typed λ-calculus and the polymorphic λ-calculus (system F) with the full set of logical connectives, and all the permutative reductions. The normalization proofs use translations of terms and types of λ→,∧,∨,⊥ to terms and types of λ→ and from F∀,∃,→,∧,∨,⊥ to F∀,→.
منابع مشابه
Proofs of Normalizationfor the simply - typed - calculus , permutativeconversions and G
We study inductive characterizations of the sets of terms, the subset of strongly normalizing terms and normal forms in order to give short proofs of weak and strong normalization for the simply-typed-calculus and for an extension by sum types with permutative conversions. In contrast to the strong computability/candidate style a la Tait and Girard this proof can be formalized in primitive recu...
متن کاملArithmetical proofs of strong normalization results for the symmetric λμ-calculus
The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ′, which is the symmetric of μ, is added. We give arithmetical proofs of some strong normalization results for this calculus. We show (this is a new result) that the μμ′-reduction is strongly normalizing for the un-typed calculus. We also show the strong normalization of the βμμ′-reduction for the ty...
متن کامل7 M ay 2 00 9 Arithmetical proofs of strong normalization results for the symmetric λ μ - calculus
The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ′, which is the symmetric of μ, is added. We give arithmetical proofs of some strong normalization results for this calculus. We show (this is a new result) that the μμ′-reduction is strongly normalizing for the un-typed calculus. We also show the strong normalization of the βμμ′-reduction for the ty...
متن کاملStrong Normalization of Moggis's Computational Metalanguage
Handling variable binding is one of the main difficulties in formal proofs. In this context, Moggi’s computational metalanguage serves as an interesting case study. It features monadic types and a commuting conversion rule that rearranges the binding structure. Lindley and Stark have given an elegant proof of strong normalization for this calculus. The key construction in their proof is a notio...
متن کاملContinuous Semantics for Termination Proofs
We prove a general strong normalization theorem for higher type rewrite systems based on Tait’s strong computability predicates and a strictly continuous domain-theoretic semantics. The theorem applies to extensions of Gödel’s system T , but also to various forms of bar recursion for which strong normalization was hitherto unknown.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008